Orbits in one-dimensional finite linear cellular automata
نویسندگان
چکیده
منابع مشابه
Orbits in one-dimensional finite linear cellular automata.
Periodicity and relaxation are investigated for the trajectories of the states in one-dimensional finite cellular automata with rule-90 and 150. The time evolutions are described with matrices. Eigenvalue analysis is applied to clarify the maximum value of period and relaxation. Typeset using REVTEX 1
متن کاملOne-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
One-dimensional quantum cellular automata (QCA) consist in a line of identical, finite dimensional quantum systems. These evolve in discrete time steps according to a local, shift-invariant unitary evolution. By local we mean that no instantaneous long-range communication can occur. In order to define these over a Hilbert space we must restrict to a base of finite, yet unbounded configurations....
متن کاملOne - dimensional quantum cellular automata over finite , unbounded configuration
Cellular automaton (CA) is a model of computation that use a local evolution rule to update iteratively a set of cells. Because of its connection with physics, the idea of generalizing this model with quantum effects was present very early, even already in the famous Feynman’s 1982 paper [3]. Since then, a lot of different approaches have been tried to formalize the notion of quantum cellular a...
متن کاملLinear Cellular Automata and Finite Automata
Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiautomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity of the global maps. We also comment on Wolfram’s question about the growth rates of the minimal f...
متن کاملBounds for One-dimensional Cellular Automata: A Linear Algebraic Approach
In [CK05], E. Czeizler and J. Kari used a linear algebraic tool to obtain good upper bounds for the length of the inverse neighbourhood of reversible one-dimensional cellular automata (CA). Recently, a linear algebraic approach similar to the one used by J. Kari in [Kar03], lead to better upper bounds for the length of the shortest unbalanced words, shortest orphans and shortest diamonds of non...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 1994
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.49.1168